An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines
نویسندگان
چکیده
We study the problem of online packet routing in dynamic store-and-forward directed line networks. We present a centralized randomized online algorithm that achieves a throughput that is O(log n)-competitive, where n denotes the number of nodes. Our algorithm is applicable to all values of buffer sizes and communication link capacities. In particular, it holds also for unit buffers. This algorithm improves the best previous O(log n)-competitive ratio of [AZ05] and considers links with unit capacities.
منابع مشابه
Packet Routing and Information Gathering in Lines, Rings and Trees
We study the problem of online packet routing and information gathering in lines, rings and trees. A network consists of n nodes. At each node there is a buffer of size B. Each buffer can transmit one packet to the next buffer at each time step. The packets injection is under adversarial control. Packets arriving at a full buffer must be discarded. In information gathering all packets have the ...
متن کاملOnline Packet Admission and Oblivious Routing in Sensor Networks
The concept of Oblivious Routing for general undirected networks was introduced by Räcke [12] when he showed that there exists an oblivious routing algorithm with polylogarithmic competitive ratio (w.r.t. edge congestion) for any undirected graph. In a following result, Räcke and Rosén [13] presented admission control algorithms achieving a polylogarithmic fraction (in the size of the network) ...
متن کاملAn online throughput-competitive algorithm for multicast routing and admission control
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of requests accepted by the optimum offline algorithm to the expected number of requests accepted by our algorithm is O((logn + log logM)(logn + logM) logn), where M is the number of multicast groups and n is the number of nod...
متن کاملBetter Online Deterministic Packet Routing on Grids
We consider the following fundamental routing problem. An adversary inputs packets arbitrarily at sources, each packet with an arbitrary destination. Traffic is constrained by link capacities and buffer sizes, and packets may be dropped at any time. The goal of the routing algorithm is to maximize throughput, i.e., route as many packets as possible to their destination. Our main result is an O ...
متن کاملCompetitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequence of edge weight changes and has to choose a minimum spanning tree after each such change in the graph. The task of the algorithm is to perform as few changes in its minimum spanning tree as possible. We compare the number o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010